UPC - PDFSEARCH.IO - Document Search Engine

UPC
Results: 2549

#	Item
11	CAV 2007 19th International Conference on Computer-Aided Verification July 2007, Berlin, Germany SMT 2007: Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2007-07-09 05:14:16 Theoretical computer science Logic in computer science Formal methods Mathematical logic Mathematics Electronic design automation NP-complete problems Constraint programming Boolean satisfiability problem Satisfiability modulo theories Horn clause Satisfiability
12	nosatelite-3card-6card.ps Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2009-04-02 05:06:14 Constraint programming Local consistency XTR
13	Efficient E-matching for SMT Solvers Leonardo de Moura, Nikolaj Bjørner Microsoft Research, Redmond Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2007-07-25 04:45:02 Computer programming Software engineering Combinatorial optimization Matching Monad Conditional
14	Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates Javier Larrosa, Robert Nieuwenhuis, Albert Oliveras, Enric Rodr´ıguez-Carbonell? Abstract. We consider optimization problems of th Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2009-04-02 05:06:42 Theoretical computer science Mathematics Formal methods Mathematical logic Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Resolution COMPASS/Sample Code BCD
15	Semiring-Induced Propositional Logic: Definition and Basic Algorithms ∗ † Javier Larrosa, Albert Oliveras and Enric Rodr´ıguez-Carbonell Technical University of Catalonia Barcelona, Spain larrosa,oliveras,erodri@ls Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2010-07-28 04:32:18 Mathematics Theoretical computer science Automated theorem proving Algebra Logic in computer science Algebraic structures Semiring Boolean satisfiability problem DPLL algorithm Unit propagation Maximum satisfiability problem Resolution
16	Proving Non-termination Using Max-SMT? Daniel Larraz1 , Kaustubh Nimkar2 , Albert Oliveras1 , Enric Rodr´ıguez-Carbonell1 , and Albert Rubio1 1 Universitat Polit`ecnica de Catalunya, Barcelona Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2015-03-02 09:06:39 Mathematical analysis Ergodic theory Differential topology Mathematics Computability theory Lie algebras Non-associative algebras Hopf decomposition Orbifold
17	SAT modulo the theory of linear arithmetic: Exact, inexact and commercial solvers Germain Faure, Robert Nieuwenhuis, Albert Oliveras and Enric Rodr´ıguez-Carbonell 11th International Conference, SAT 2008 Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2008-05-19 09:02:24 Theoretical computer science Mathematics Mathematical logic Logic in computer science Boolean algebra Electronic design automation Formal methods NP-complete problems Solver Propositional calculus AMPL Modulo operation
18	SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri? , Robert Nieuwenhuis?? , and Albert Oliveras?? Abstract. Predicate abstraction is a technique for automatically extracting finite-state abstractions for s Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2006-06-09 05:24:28 Mathematical logic Mathematics Theoretical computer science Formal methods Electronic design automation Logic in computer science NP-complete problems Boolean algebra Satisfiability modulo theories Boolean satisfiability problem 120-cell Predicate
19	Abstract DPLL and Abstract DPLL Modulo Theories Robert Nieuwenhuis? , Albert Oliveras? , and Cesare Tinelli ?? Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2005-01-28 04:06:06 Theoretical computer science Mathematical logic Mathematics Automated theorem proving Boolean algebra Constraint programming Logic in computer science Formal methods DPLL algorithm Conflict-driven clause learning Boolean satisfiability problem Satisfiability modulo theories
20	DPLL(T) with Exhaustive Theory Propagation and its Application to Difference Logic Robert Nieuwenhuis and Albert Oliveras? Abstract. At CAV’04 we presented the DPLL(T ) approach for satisfiability modulo theories T . I Add to Reading List Source URL: www.lsi.upc.edu Language: English - Date: 2005-06-14 03:44:48 Theoretical computer science Mathematics Mathematical logic Boolean algebra Formal methods Logic in computer science Electronic design automation NP-complete problems Boolean satisfiability problem Satisfiability modulo theories Unit propagation Literal